Sahlqvist Theory for Hybrid Logics (Unified Correspondence IV)
نویسندگان
چکیده
Hybrid logics extends modal logic with a special sort of variables, called nominals, which are evaluated to singletons in Kripke models by valuations, thus acting as names for states in models, see e.g., [1], [2] and [7]. Various other connectives which capitalize on this naming power of the nominals and, in so doing, enhance the expressive power of these languages even further, can be included, most characteristically the satisfaction operator, @ i ϕ, allowing one to express that ϕ holds at the world named by a nominal i. A natural research direction is to investigate the transfer of results from modal logic to hybrid logics. Indeed a lot of work has been done in this direction. One may, for example, consider Sahlqvist theory, which is extremely well developed for modal logic. The reader will recall that every modal Sahlqvist formula enjoys two properties: firstly, it has a local-first order frame correspondent and, secondly, it is canonical. The second property implies that any normal modal logic axiomatized with Sahlqvist formulas (in addition to the axioms of the basic modal logic K) is strongly complete with respect to its Kripke frames. As regards Sahlqvist theory for hybrid logic, it is fairly straightforward to see that nominals may be freely introduced into modal Sahlqvist formulas without destroying the first property. The second property is more tricky. In this regard, Ten Cate, Marx and Viana [10] showed that any hybrid logic obtained by adding modal Sahlqvist formulas to the basic hybrid logic H (the logic obtained by adding the axiom 3 n (i ∧ p) → 2 m (i → p), n, m ∈ N, and the rule that ¬i implies ⊥ to the basic modal logic K) is strongly complete. Also, one of the very first results in the study of hybrid logic was the fact that any extension of H with pure axioms (formulas containing no propositional variables but only possibly nominals) is strongly complete [7]. In [10], it is shown that these two results cannot be combined in general, since there is a modal Sahlqvist formula and a pure formula which together give a Kripke-incomplete logic when added to H. The intention of the present work is to see to what extent these two results can be combined and to develop a genuinely hybrid Sahlqvist theory. Some initial results in this direction appear in [3]. We define a hybrid version of …
منابع مشابه
Algorithmic Correspondence and Canonicity for Possibility Semantics (Abstract)
Unified Correspondence. Correspondence and completeness theory have a long history in modal logic, and they are referred to as the “three pillars of wisdom supporting the edifice of modal logic” [22, page 331] together with duality theory. Dating back to [20,21], the Sahlqvist theorem gives a syntactic definition of a class of modal formulas, the Sahlqvist class, each member of which defines an...
متن کاملConstructive Canonicity for Lattice-Based Fixed Point Logics
The present contribution lies at the crossroads of at least three active lines of research in nonclassical logics: the one investigating the semantic and proof-theoretic environment of fixed point expansions of logics algebraically captured by varieties of (distributive) lattice expansions [1, 19, 24, 2, 16]; the one investigating constructive canonicity for intuitionistic and substructural log...
متن کاملSahlqvist Theorems for Precontact Logics
Precontact logics are propositional modal logics that have been recently considered in order to obtain decidable fragments of the region-based theories of space introduced by De Laguna and Whitehead. We give the definition of Sahlqvist formulas to this regionbased setting and we prove correspondence and canonicity results. Together, these results give rise to a completeness result for precontac...
متن کاملSahlqvist Formulas in Hybrid Polyadic Modal Logics
Building on a new approach to polyadic modal languages and Sahlqvist formulas introduced in [10] we define Sahlqvist formulas in hybrid polyadic modal languages containing nominals and universal modality or satisfaction operators. Particularly interesting is the case of reversive polyadic languages, closed under all ‘inverses’ of polyadic modalities because the minimal valuations arising in the...
متن کاملOrder theoretic Correspondence theory for Intuitionistic mu-calculus
Sahlqvist correspondence theory [3], [4] is one of the most important and useful results of classical modal logic. It gives a syntactic identification of a class of modal formulas whose associated normal modal logics are strongly complete with respect to elementary (i.e. first-order definable) classes of frames. Every Sahlqvist formula is both canonical and corresponds to some elementary frame ...
متن کامل